The Capacity of a Stegosystem for the Noisy Attack Channel
نویسندگان
چکیده
We consider a scenario where an attacker is able to receive a stegosignal only over a noisy channel under the condition that he (or she) may even know the cover message (CM). We propose to use a spread-spectrum-signal-based stegosystem (SG) and prove that the capacity of such SG is zero for any fixed security level. Moreover, we show that the code rate satisfies a square root law due to Ker et al. (in reality this law can be found in an earlier paper (2005) by the authors of the current paper). We get the same result for a conventional SG where the CM is modeled by a Gaussian correlated sequence with a correlation matrix unknown for the SG designer. We speculate that for any conventional SG with noiseless attack channel but for a practical CM model, the capacity should also be zero.
منابع مشابه
Stegosystems Based on Noisy Channels
Resumen We propose a significant deviation from the standard steganography problem formulation. Here, an attacker is able to receive a stegosignal only over noisy channels. There may be also situations in which the presence of a noisy channel is simulated by a designer of the stegosystem to hide secret messages. Two models of noisy channels are considered: binary symmetric channel (BSC) and add...
متن کاملExtension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کاملمحاسبه ظرفیت شبکه عصبی هاپفیلد و ارائه روش عملی افزایش حجم حافظه
The capacity of the Hopfield model has been considered as an imortant parameter in using this model. In this paper, the Hopfield neural network is modeled as a Shannon Channel and an upperbound to its capacity is found. For achieving maximum memory, we focus on the training algorithm of the network, and prove that the capacity of the network is bounded by the maximum number of the ortho...
متن کاملKeyless Authentication and Authenticated Capacity
We consider the problem of keyless message authentication over noisy channels in the presence of an active adversary. Different from the existing models, in our model, the legitimate users do not have any pre-shared key for authentication. Instead, we use the noisy channel connecting the legitimate users for authentication. The main idea is to utilize the noisy channel connecting the legitimate...
متن کاملGaussian Z Channel with Intersymbol Interference
In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012